Simulating surgical incisions without polygon subdivision.

نویسندگان

  • Yogendra Bhasin
  • Alan Liu
  • Mark Bowyer
چکیده

Modeling cuts, bleeding and the insertion of surgical instruments are essential in surgical simulation. Both visual and haptic cues are important. Current methods to simulate cuts change the topology of the model, invalidating pre-processing schemes or increasing the model's complexity. Bleeding is frequently modeled by particle systems or computational fluid dynamics. Both can be computationally expensive. Surgical instrument insertion, such as intubation, can require complex haptic models. In this paper, we describe methods for simulating surgical incisions that do not require such computational complexity, yet preserve the visual and tactile appearance necessary for realistic simulation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES

Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...

متن کامل

Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In th...

متن کامل

Binary Subdivision Schemes for Functionsover Irregular Knot

For a wide class of stationary subdivision methods, we derive necessary and suucient conditions for these schemes to produce C k continuous limit curves. These stationary schemes include those arising from midpoint subdivision of irregularly-spaced knot sequences. We also describe a matrix method for computing various derivative schemes associated with such stationary schemes. x1. Introduction ...

متن کامل

Binary Subdivision Schemes for Functions over Irregular Knot Sequences

For a wide class of stationary subdivision methods, we derive necessary and suucient conditions for these schemes to produce C k continuous limit curves. These stationary schemes include those arising from midpoint subdivision of irregularly-spaced knot sequences. We also describe a matrix method for computing various derivative schemes associated with such stationary schemes. x1. Introduction ...

متن کامل

Relational Specification of Surface Subdivision Algorithms

Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. We address this discrepancy by defining a set of local operations on polygon meshes in relational, index-free terms. We also introduce the vv programming language to express these operations in a machine-readable form. We then apply vv to specify several surface subdivision algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studies in health technology and informatics

دوره 111  شماره 

صفحات  -

تاریخ انتشار 2005